CPSC 548 - Directed Studies - Report Vertex-Edge Quadric for Edge Collapse Mesh Simplification
نویسنده
چکیده
In order to preserve structural edges and shapes while simplifying the triangle mesh of man-made 3D models, we propose a new quadric error metric based on the distances between the new vertex position and the affected edges for edge collapse operations. With a 2D view sampling method, the contour and silhouette likelihood of the edges are computed, which act as the quadric’s weights during the mesh decimation. The comparisons and analysis among our methods with different weighting schemes will be presented in this report. We also compare our method with QSlim [Garland and Heckbert 1997] and structure-aware mesh decimation method [Salinas et al. 2015] in multiple cases. Output generated by our method is better than QSlim and comparable to structure-aware method in most of the cases.
منابع مشابه
A New Mesh Simplification Algorithm Combining Half-Edge Data Structure with Modified Quadric Error Metric
This paper presents a fast mesh simplification algorithm that combined the half-edge data structure with modified quadric error metric (QEM). When half-edge structure is used, the adjacency queries between components of the mesh, such as vertices, faces and edges, can be quickly achieved and thus the run time is reduced remarkably. Furthermore, with the modified quadric error metric, the qualit...
متن کاملGPU-Accelerated Triangle Mesh Simplification Using Parallel Vertex Removal
We present an approach to triangle mesh simplification designed to be executed on the GPU. We use a quadric error metric to calculate an error value for each vertex of the mesh and order all vertices based on this value. This step is followed by the parallel removal of a number of vertices with the lowest calculated error values. To allow for the parallel removal of multiple vertices we use a s...
متن کاملMesh parameterization based on edge collapse *
Parameterizations that use mesh simplification to build the base domain always adopt the vertex removal scheme. This paper applies edge collapse to constructing the base domain instead. After inducing the parameterization of the original mesh over the base domain, new algorithms map the new vertices in the simplified mesh back to the original one according to the edge transition sequence to int...
متن کاملProgressive linear triangle surface mesh implementation. Pitfalls and challenges
The need of progressive mesh scheme originated from an idea of web servicebased ordered computations system described in [6]. Progressive format introduced by Hoppe in [2, 3] was found very suitable in the Internet transmission of large data sets. In result of its flexibility, many derivatives was developed [5, 8]. Despite its straightforward basis, there are some challenges that must to be ove...
متن کاملSurface Partitions for Progressive Transmission and Display, and Dynamic Simplification of Polygonal Surfaces
We present a new method for (1) automatically generating multiple Levels Of Detail (LODs) of a polygonal surface, (2) progressively loading, or transmitting, and displaying a surface, and for (3) changing interactively the LOD when displaying. We build the LODs using any algorithm that performs edge collapses and certain vertex removals to simplify surfaces, and provides an ordered list of orde...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017